Relations between Abs-Normal NLPs and MPCCs. Part 1: Strong Constraint Qualifications

This work is part of an ongoing effort comparing non-smooth optimization problems in abs-normal form to MPCCs. We study the general NLP with equality and inequality constraints relation equivalent MPCC reformulation. show that kink qualifications constraint linear independence type Mangasarian-Fromovitz are equivalent. Then we consider strong stationarity concepts first second order optimality conditions, which again turn out be for two problem classes. Throughout also specific slack reformulations suggested [9], preserve but not type.